DG coalgebras as formal stacks

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formal Gaga on Artin Stacks

Suppose X is a locally noetherian Deligne–Mumford stack. Definition 1.2 has an obvious variant X̂ét using the underlying smaller étale site Xét and the restriction Oc Xét of Oc X to this site. By [3, 12.7.4], the category of cartesian Oc X -modules on Xlis-ét is equivalent to the category of Oc Xét-modules on Xét: (1.1) ModXlis-ét,cart(Oc X ) ' ModXét(Oc Xét) Definition 1.3. Let X be a locally n...

متن کامل

K-Theory and G-Theory of DG-stacks

In this paper, we establish results of a basic nature for the the K-theory and G-theory of algebraic stacks, i.e. Artin stacks. At the same time, we enlarge the framework a bit more so that these results not only hold for stacks, but also for what are called dg-stacks, i.e. algebraic stacks where the usual structure sheaf is replaced by a sheaf of dgas.

متن کامل

Bases as Coalgebras

The free algebra adjunction, between the category of algebras of a monad and the underlying category, induces a comonad on the category of algebras. The coalgebras of this comonad are the topic of study in this paper (following earlier work). It is illustrated how such coalgebras-on-algebras can be understood as bases, decomposing each element x into primitives elements from which x can be reco...

متن کامل

Bayesian Networks as Coalgebras

A coalgebraic description of (discrete) Bayesian networks is presented. The coalgebra map representing a network sends a node to its set of predecessors, together with the associated conditional probability tables. We use this description to describe the semantics of a network in terms of various (discrete) probability distributions associated with a node: local, joint, and conditional distribu...

متن کامل

Hybrid Automata as Coalgebras

Able to simultaneously encode discrete transitions and continuous behaviour, hybrid automata are the de facto framework for the formal specification and analysis of hybrid systems. The current paper revisits hybrid automata from a coalgebraic point of view. This allows to interpret them as state-based components, and provides a uniform theory to address variability in their definition, as well ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 2001

ISSN: 0022-4049

DOI: 10.1016/s0022-4049(00)00121-3